Online Over Time Scheduling on Parallel-Batch Machines: A Survey
نویسندگان
چکیده
منابع مشابه
Online Over Time Scheduling on Parallel-Batch Machines: A Survey
Online scheduling is a rapidly developed branch in scheduling theory. In this paper, we present an extensive survey for online over time scheduling on parallel-batch machines. Some open problems are proposed for further research.
متن کاملOnline Preemptive Scheduling on Parallel Machines
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 ≥ s 2 ≥. .. ≥ s m and a sequence of jobs, each described by its processing time (length). The actual time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several piec...
متن کاملStochastic Online Scheduling on Parallel Machines
We propose a model for non-preemptive scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to the traditional stochastic scheduling models, we assume that jobs arrive online over time, and there is no knowledge about the jobs that will a...
متن کاملA Survey of Energy Efficient Scheduling Algorithms for Real-time Systems over Parallel Machines
A real-time system is defined as any information processing system which has to respond to externally generated input stimuli within a finite and specified period, in other words it is defined as the ability of the system to guarantee a response after a fixed time has elapsed. Computational real-time systems are increasingly used to control tasks in numerous application fields like aircraft, au...
متن کاملOptimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2014
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-014-0060-0